18.405J S16 Lecture 22: Derandomization Implies Circuit Lower Bounds
ثبت نشده
چکیده
Q: Why are we using circuit lower bounds here, as opposed to a claim such as E ̸⊆ P for example? A: The proof of the Nisan-Wigderson pseudorandom generator relies on nonuniformity, by showing that distinguishing a pseudorandom generator implies a circuit for solving a hard problem – this reduction involves hardwiring advice into a circuit in order to solve the hard problem. A contradiction requires that the hard problem has circuit lower bounds.
منابع مشابه
18.405J S16 Lecture 6: AC0 Lower Bounds and Switching Lemma
The key ingredient is the so-called Switching Lemma. To state it we need a notion of p-restrictions. Say we have a function f : {0, 1}n → {0, 1}. Then we say that a function f ′ is a p-restriction of f , if it is obtained from f via the following process. Each variable is set to zero with probability (1− p)/2, and is set to one with the same probability (so, with probability p a variable is not...
متن کاملA note on circuit lower bounds from derandomization
We present an alternate proof of the result by Kabanets and Impagliazzo that derandomizing polynomial identity testing implies circuit lower bounds. Our proof is simpler, scales better, and yields a somewhat stronger result than the original argument.
متن کاملTighter Connections between Derandomization and Circuit Lower Bounds
We tighten the connections between circuit lower bounds and derandomization for each of the following three types of derandomization: general derandomization of promise-BPP (connected to Boolean circuits), derandomization of Polynomial Identity Testing (PIT) over fixed finite fields (connected to arithmetic circuit lower bounds over the same field), and derandomization of PIT over the integers ...
متن کاملOn Circuit Lower Bounds from Derandomization
We present an alternate proof of the result by Kabanets and Impagliazzo (2004) that derandomizing polynomial identity testing implies circuit lower bounds. Our proof is simpler, scales better, and yields a somewhat stronger result than the original argument. ACM Classification: F.1.2, F.1.3 AMS Classification: 68Q10, 68Q15, 68Q17
متن کامل18.405J S16 Lecture 1: PH Time-Space Tradeoffs
The main result of this lecture is that NTIME(n) has algorithms which do not run in time n1.2 and use n0.2 space. We begin by reviewing some major open problems in complexity theory and describing how this result fits into those open problems. We define the classes in basic complexity theory and the Polynomial Hierarchy. Then we prove the main theorem by using 2 claims. The method we use is an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012